On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
نویسندگان
چکیده
منابع مشابه
Intersection cuts - standard versus restricted
This note is meant to elucidate the difference between intersection cuts as originally defined, and intersection cuts as defined in the more recent literature. It also states a basic property of intersection cuts under their original definition. Intersection cuts for mixed integer programs were introduced in the early 1970’s [1, 2] as inequalities obtained by intersecting the extreme rays of th...
متن کاملPartial hyperplane activation for generalized intersection cuts
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe that a key hyperplane activation procedure embedded in it is not computationally viable. To overcome this issue, we develop a novel replacement to this procedur...
متن کاملCorner Polyhedron and Intersection Cuts
Four decades ago, Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. A recent paper of Andersen, Louveaux, Weismantel and Wolsey has generated a renewed interest in the corner polyhedron and intersection cuts. We survey these two approaches and the recent developments in multi-row cuts....
متن کاملSplit Closure and Intersection Cuts
In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of an MILP, and showed that the split closure is a polyhedron. In this paper, we show that the...
متن کاملIntersection Cuts for Bilevel Optimization
We address a generic Mixed-Integer Bilevel Linear Program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are linear, and some/all variables are required to take integer values. Rather than proposing an ad-hoc method applicable only to specific cases, we describe a general-purpose MIBLP approach. We first propose necessary modifications needed to turn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-015-0975-1